Threshold incentives over multiple periods and the sales hockey stick phenomenon

In this article, we study threshold‐based sales‐force incentives and their impact on a dealer's optimal effort. A phenomenon, observed in practice, is that the dealer exerts a large effort toward the end of the incentive period to boost sales and reach the threshold to make additional profits. In the literature, the resulting last‐period sales spike is sometimes called the hockey stick phenomenon (HSP). In this article, we show that the manufacturer's choice of the incentive parameters and the underlying demand uncertainty affect the dealer's optimal effort choice. This results in the sales HSP over multiple time periods even when there is a cost associated with waiting. We then show that, by linking the threshold to a correlated market signal, the HSP can be regulated. We also characterize the variance of the total sales across all the periods and demonstrate conditions under the sales variance can be reduced. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

军事供应链不确定性产生机理研究

军事供应链中不可避免地存在不确定性。构建了军事供应链不确定性产生机理的概念模型,从需求、供应、环境三个方面分析了军事供应链不确定性产生的原因,同时,对军事供应链中可能存在的各种不确定性进行了讨论,明确了加剧不确定性影响的因素是军事供应链系统的复杂性。具体表现为军事供应链成员交互关系的复杂性和军事供应链网络结构的复杂性。提出正是由于这两个原因的存在,对军事供应链的保障性能产生了巨大的影响。     

可修系统的一个模型

本文研究一种具有4种故障形式的可修系统。利用向量Markov过程方法,求出了系统的可靠性指标。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

The impact of animal welfare regulations on firms' product offerings: Humane or organic product?

Increased public concerns about animal welfare have spurred new regulations to improve animals' treatment and living conditions. We study how these regulations affect firms' product offerings, prices, and profits. We consider two competing animal agriculture supply chains, each consisting of a supplier and a buyer. New regulations require firms to choose between offering humane or organic products, which are differentiated by animals' living conditions. We find that consumers' growing awareness of animal welfare encourages firms to offer organic products, which require the highest standards for animals' living conditions. We also show that tightening humane product standards and loosening organic product standards encourage firms to offer organic products—but with distinct pricing implications. The former leads to higher retail prices whereas the latter may lower retail prices. Depending on costs and consumers' awareness of animal welfare, a humane product may be priced higher or lower than an organic product. Furthermore, we provide conditions under which a regulator should offer a unit-cost or an investment cost subsidy to improve social welfare. We show that subsidies can encourage firms to change from offering humane to organic products, or vice versa, to enhance total social welfare.     

Performance analysis of queue length monitoring of M/G/1 systems

This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n. Next is the individual chart with a warning zone whose control scheme is specified by two pairs of parameters, (upper control limit, d_u) and (lower control limit, d_l), as proposed by Bhat and Rao (Oper Res 20 (1972) 955–966). We will present approaches to calculate ARL for the two types of control charts using the Markov chain formulation and also investigate the effects of parameters of the control charts to provide useful design guidelines for better performance. Extensive numerical results are included for illustration. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于TSMD-SVM-HMM的机内测试智能降虚警方法

机内测试虚警问题是影响系统完好性和使用保障费用的重要因素。针对环境因素导致的虚警问题,设计了时间环境应力测量装置,应用支持向量机的小样本学习优点,建立虚警与环境因素的关联关系,应用隐马尔可夫模型的连续动态信号处理能力,描述系统长期工作历程中虚警的发生规律,提出了基于时间环境应力测量装置-支持向量机-隐马尔可夫模型的机内测试智能降虚警方法。最后,在某型直升机航向姿态系统上进行了应用与验证,试验结果表明:该方法有效识别出了机内测试的虚警。     

演化硬件中变异概率对进化算法首次命中时间的影响

在(1+1)EAs中,采用马尔可夫链推移时间分析法,推导出了平均首次命中时间的表达式。从理论上分析了变异概率对平均首次命中时间的影响。结果表明适当的变异概率会缩短平均首次命中时间,加快进化算法的寻优时间。     

Optimal maintenance policies for a safety‐critical system and its deteriorating sensor

We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017     

颠覆性技术发展面临的挑战与对策

信息攻防作战力量既可以独立成军成战,又可以和各军兵种、各种武器平台无缝衔接、联合协同,以发挥无限的战争潜力,是以信息攻防新技术为支撑、以软硬打击新能力为标志的新型作战力量。从核心信息基础设施建设,信息攻击和防护能力建设以及信息攻防协同作战三个方面论述了信息攻防新型作战力量建设的重要问题及战法对策,对信息攻防作战的特点规律和技术手段进行了剖析。